Stability in stochastic programming with recourse-estimated parameters

نویسنده

  • Jitka Dupacová
چکیده

In this paper, stability of the optimal solution of stochastic programs with recourse with respect to parameters of the given distribution of random coefficients is studied. Provided that the set of admissible solutions is defined by equa[ity constraints only, asymptotical normality of the optimal solution follows by standard methods, If nonnegativity constraints are taken into account the problem is solved under assumption of strict complementarity known from the theory of nonlinear programming (Theorem 1). The general results are applied to the simple recourse problem with random right-hand sides under various assumptions on the underlying distribution (Theorems 2-4).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-item inventory model with probabilistic demand function under permissible delay in payment and fuzzy-stochastic budget constraint: A signomial geometric programming method

This study proposes a new multi-item inventory model with hybrid cost parameters under a fuzzy-stochastic constraint and permissible delay in payment. The price and marketing expenditure dependent stochastic demand and the demand dependent the unit production cost are considered. Shortages are allowed and partially backordered. The main objective of this paper is to determine selling price, mar...

متن کامل

Multi-Objective Stochastic Programming in Microgrids Considering Environmental Emissions

This paper deals with day-ahead programming under uncertainties in microgrids (MGs). A two-stage stochastic programming with the fixed recourse approach was adopted. The studied MG was considered in the grid-connected mode with the capability of power exchange with the upstream network. Uncertain electricity market prices, unpredictable load demand, and uncertain wind and solar power values, du...

متن کامل

On the Stability in Stochastic Programming - Generalized Simple Recourse Problems

Stochastic programming problems with simple recourse belong to problems depending on a random element only through the corresponding probability measure. Consequently, this probability measure can be treated as a parameter of the problem. In this paper the stability with respect to the above mentioned parameter will be studied for generalized simple recourse problems.

متن کامل

Lipschitz Stability for Stochastic Programs with Complete Recourse

This paper investigates the stability of optimal solution sets to stochastic programs with complete recourse, where the underlying probability measure is understood as a parameter varying in some space of probability measures.piro proved Lipschitz upper semicontinuity of the solution set mapping. Inspired by this result, we introduce a subgradient distance for probability distributions and esta...

متن کامل

Dynamic Slope Scaling Procedure for Stochastic Integer Programming Problem

Mathematical programming has been applied to various problems. For many actual problems, the assumption that the parameters involved are deterministic known data is often unjustified. In such cases, these data contain uncertainty and are thus represented as random variables, since they represent information about the future. Decision-making under uncertainty involves potential risk. Stochastic ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Program.

دوره 28  شماره 

صفحات  -

تاریخ انتشار 1984